Linear Probing with 5-wise Independence
نویسندگان
چکیده
منابع مشابه
Linear Probing with 5-wise Independence
Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms for storing (key,value) pairs. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous analyses rely either on complicated and space consuming hash functions, or on the unrealistic assumption of free...
متن کاملLinear Probing with 5-Independent Hashing
These lecture notes show that linear probing takes expected constant time if the hash function is 5-independent. This result was first proved by Pagh et al. [STOC’07,SICOMP’09]. The simple proof here is essentially taken from [Pǎtraşcu and Thorup ICALP’10]. We will also consider a smaller space version of linear probing that may have false positives like Bloom filters. These lecture notes illus...
متن کاملAlmost k-wise independence versus k-wise independence
We say that a distribution over {0, 1} is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. A natural question regarding ( , k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exists ( , k)-wise independent distribution whose statistical distance...
متن کاملt-Wise independence with local dependencies
In this note we prove a large deviation bound on the sum of random variables with the following dependency structure: there is a dependency graph G with a bounded chromatic number, in which each vertex represents a random variable. Variables that are represented by neighboring vertices may be arbitrarily dependent, but collections of variables that form an independent set in G are t-wise indepe...
متن کاملK-wise Independence and -biased K-wise Indepedence
1 Deenitions Consider a distribution D on n bits x = x 1 x n. D is k-wise independent ii for all sets of k indices S = fi 1 x ik = a 1 a k ] = 1 2 k : The idea is that if we restrict our attention to any k positions in x, no matter how many times we sample from D, we cannot distinguish D from the uniform distribution over n bits. We can get a Fourier interpretation of k-wise independence by vie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 2011
ISSN: 0036-1445,1095-7200
DOI: 10.1137/110827831